Parallel WZ factorization on mesh multiprocessors

نویسندگان

  • Rafael Asenjo
  • Manuel Ujaldon
  • Emilio L. Zapata
چکیده

We present a parallel algorithm for the QIF (Quadrant Interlocking Factorization) method, which solves linear equation systems using WZ factorization. The parallel algorithm we developed is general in the sense that it does not impose any restrictions on the size of the problem and that it is independent from the dimensions oJ the mesh. The result is an efficient algorithm using half the messages of the equivalent parallel LU algorithm. Finally, we have compared the QIF algorithm in multiprocessor architectures with mesh topology and hypercube topology, obtaining similar calculation times for both architectures. This last aspect confirms the communication redundancy of the hypercube topology, which raises hardware costs without any significant improvement in the efficiency of the algorithms. The solution of a linear equation system is a problem which arises in many situations, whether scientific (simulations, solution of differential equation systems), economic (resource assignment, econometric models in general) and engineering (passive electronic circuits), etc. The QIF (Quadrant Interlocking Factorization) algorithm, introduced by Evans and Hatzopoulos in 1979 [EvHa79], is a numerical method for finding a solution for systems of the type Ax=b, where A is a non singular matrix of dimensions (N×N), x is an unknown column vector, and b is the independent term vector provided. The QIF method is based on the WZ factorization of the system matrix, A = WZ. The main advantage of this factorization is that it presents a complexity order half of the one in the LU decomposition, due to the fact that it performs the simultaneous evaluation of two columns or two rows. A detailed description of this algorithm can be found in [EvHa79], [EvHa80], [EHN81], [Evan82] and [Hatz82]. We will just summarize its basic steps. Matrices W and Z into which we are going to factor matrix A, are: 1 0 0 wl, 0 1 0 Wl,u_ 1 w2, 0 w2, t 1 0 W2,N_ 2 W2,N_ 1 wN_3, 0 WN_3, l 0 1 WN_3~V_ 2 WN_3,N_ 1 WN_2, 0 0 1 WN_2,N_ 1 0 0 1 Z-(1)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the WZ Factorization of the Real and Integer Matrices

The textit{QIF}  (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ}  factorization. The  WZ factorization can be faster than the textit{LU} factorization  because,  it performs the simultaneous evaluation of two columns or two rows. Here, we present a  method for computing the real and integer textit{WZ} and  textit{ZW} factoriz...

متن کامل

WZ factorization via Abay-Broyden-Spedicato algorithms

Classes of‎ ‎Abaffy-Broyden-Spedicato (ABS) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎The algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎Here‎, ‎we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW‎ ‎factorizations of a nonsingular matrix as well as...

متن کامل

Solving linear systems with vectorized WZ factorization

Abstract In the paper we present a vectorized algorithm for WZ factorization of a matrix which was implemented with the BLAS1 library. We present the results of numerical experiments which show that vectorization accelerates the sequential WZ factorization. Next, we parallelized both algorithms for a two-processor shared memory machine using the OpenMP standard. We present performances of these...

متن کامل

Parallel Algorithm for Symmetric Positive Definite Banded Linear Systems: A Divide and Conquer Approach

The WZ factorization for the solution of symmetric positive definite banded linear systems when combined with a partitioned scheme, renders a divide and conquer algorithm. The WZ factorization of the coefficient matrix in each block has the properties: the vector [a1, . . . , aβ , 0, . . . , 0, an−β+1, . . . , an] is invariant under the transformation W where β is the semibandwidth of the coeff...

متن کامل

Parallel Solution of Sparse Linear Least Squares Problems on Distributed-Memory Multiprocessors

This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Microprocessing and Microprogramming

دوره 38  شماره 

صفحات  -

تاریخ انتشار 1993